- circle polynomial
- мат.круговой многочлен, многочлен деления круга
English-Russian scientific dictionary. 2008.
circle polynomial
Смотреть что такое "circle polynomial" в других словарях:
Polynomial lemniscate — In mathematics, a polynomial lemniscate or polynomial level curve is a plane algebraic curve of degree 2n, constructed from a polynomial p with complex coefficients of degree n.For any such polynomial p and positive real number c, we may define a … Wikipedia
Circle packing theorem — Example of the circle packing theorem on K5, the complete graph on five vertices, minus one edge. The circle packing theorem (also known as the Koebe–Andreev–Thurston theorem) describes the possible tangency relations between circles in the plane … Wikipedia
Circle graph — For the chart, see Pie chart. A circle with five chords and the corresponding circle graph. In graph theory, a circle graph is the intersection graph of a set of chords of a circle. That is, it is an undirected graph whose vertices can be… … Wikipedia
Splitting circle method — In mathematics, the splitting circle method is a numerical algorithm for the numerical factorization of a polynomial and, ultimately, for finding its complex roots. It was introduced by Arnold Schönhage in his 1982 paper The fundamental theorem… … Wikipedia
Alexander polynomial — In mathematics, the Alexander polynomial is a knot invariant which assigns a polynomial with integer coefficients to each knot type. James Waddell Alexander II discovered this, the first knot polynomial, in 1923. In 1969, John Conway showed a… … Wikipedia
Trigonometric polynomial — In the mathematical subfields of numerical analysis and mathematical analysis, a trigonometric polynomial is a finite linear combination of functions sin(nx) and cos(nx) with n a natural number. The coefficients may be taken as real numbers, for… … Wikipedia
Littlewood polynomial — In mathematics, a Littlewood polynomial is a polynomial all of whose coefficients are +1 or −1.Littlewood s problem asks how large the values of such a polynomial must be on the unit circle in the complex plane. The answer to this would yield… … Wikipedia
Dividing a circle into areas — In geometry, the problem of dividing a circle into areas by means of an inscribed polygon with n sides, in such a way as to maximise the number of areas created by the edges and diagonals, has a solution by an inductive method. Contents 1 Lemma 2 … Wikipedia
Properties of polynomial roots — In mathematics, a polynomial is a function of the form: p(x) = a 0 + a 1 x + cdots a n x^n, quad xin mathbb{C}where the coefficients a 0, ldots, a n are complex numbers. The fundamental theorem of algebrastates that polynomial p has n roots. The… … Wikipedia
Bracket polynomial — In the mathematical field of knot theory, the bracket polynomial (also known as the Kauffman bracket) is a polynomial invariant of framed links. Although it is not an invariant of knots or links (as it is not invariant under type I Reidemeister… … Wikipedia
Stable polynomial — A polynomial is said to be stable if either: * all its roots lie in the open left half plane, or * all its roots lie in the open unit disk.The first condition defines Hurwitz (or continuous time) stability and the second one Schur (or discrete… … Wikipedia
